Design and Implementation of Fast Multiplication Algorithms in Public Key Cryptosystems for Smart Cards
نویسنده
چکیده
Most practical public-key cryptosystems are based on modular exponentiation. A modular exponentiation is composed of repeated modular multiplications. Several methods have been proposed to reduce the execution time of a modular exponentiation, essentially aiming to reduce the execution time of each modular multiplication. The goal of this paper is to investigate three different integer multiplication techniques, as used in conjunction with various public-key cryptographic algorithms as used a standard smart card. The aim is to obtain exact numerical results for standard multiplication algorithms used in industry. Keywords— Public-key cryptosystems, Montgomery multiplication, Barrett reduction, Classical multiplication
منابع مشابه
Optimal Use of Montgomery Multiplication on Smart Cards
Montgomery multiplication is used to speed up modular multiplications involved in public-key cryptosystems. However, it requires conversion of parameters into N -residue representation. These additional pre-computations can be costly for low resource devices like smart cards. In this paper, we propose a new, more efficient method, suitable for smart card implementations of most of public-key cr...
متن کاملLook-Up Table-based Montgomery Algorithm in GF(2k) for Public-Key Cryptosystem
The current paper presents a fast implementation of finite field multiplication, squaring, and exponentiation operations using two look-up tables, thereby reducing the number of operations, saving time through precomputation, and avoiding the complicated computations required in the Montgomery method. Furthermore, look-up table-based algorithms have the advantage of speed and are particularly s...
متن کاملA Small and Fast Software Implementation of Elliptic Curve Cryptosystems over GF (p) on a 16-Bit Microcomputer
Recently the study and implementation of elliptic curve cryptosystems (ECC) have developed rapidly and its achievements have become a center of attraction. ECC has the advantage of high-speed processing in software even on restricted environments such as smart cards. In this paper, we concentrate on complete software implementation of ECC over a prime field on a 16-bit microcomputer M16C (10MHz...
متن کاملCORSAIR: A SMART Card for Public Key Cryptosystems
Algorithms best suired forflexible smart card applications are based on public key cryptosystems RSA, zero-knowiedge protocols . . . Their practical implementation (execution in =:I second) entails a computing power beyond the reach of classical smart cards, since large integers (512 bits) have to be manipulated in complex ways (exponentiation). CORSAIR achieves up to 40 (8 bit) MIPS with a clo...
متن کاملComparison of two Public Key Cryptosystems
Since the time public-key cryptography was introduced by Diffie andHellman in 1976, numerous public-key algorithms have been proposed. Some of thesealgorithms are insecure and the others that seem secure, many are impractical, eitherthey have too large keys or the cipher text they produce is much longer than theplaintext. This paper focuses on efficient implementation and analysis of two mostpo...
متن کامل